Two-dimensional burst identification codes and their use in burst correction
نویسندگان
چکیده
منابع مشابه
Two-dimensional burst identification codes and their use in burst correction
N MOST memory devices, information is stored in two I dimensions. In such cases, errors usually take the form of two-dimensional bursts. For example, VLSI RAM chips are sensitive to alpha particles and other radiation effects which can cause two-dimensional bursts of errors. Twodimensional burst correcting codes can be used to combat such errors. Elspas [ l ] has shown that the product of two c...
متن کاملEfficient Burst Error Correction by Hermitian Codes
Hermitian codes belong to a powerful class of algebraic geometry codes, which allow to correct many independent errors. We show that Hermitian codes can correct many bursts of errors as well. Decoding of a Hermitian (N,K) code over q2 can be reduced to decoding of interleaved extended Reed-Solomon codes. Using this fact, we propose an efficient unique decoding algorithm correcting up to (N −K)/...
متن کاملCoding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes
In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single ...
متن کاملLow delay burst erasure correction codes
In a variety of networks, packet losses occur in bursts. Conventional application of error correcting codes for packet recovery often requires interleaving and long decoder delays. These long delays are usually unacceptable in real-time multimedia communication applications such as Voice over IP (VoIP). Consequently erasure correction codes with severe limits on delay are desirable. We present ...
متن کاملCodes for Multiple Localized Burst Error Correction
A new construction method for codes correcting multiple localized burst errors is proposed. The codes obtained by this method improve upon codes presented by Larsson in size, while keeping the encoding and decoding complexity low. Like the Larsson codes, the proposed codes are asymptotically optimal when the number of bursts to be corrected is fixed and the correctable burst length grows linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1988
ISSN: 0018-9448
DOI: 10.1109/18.6029